Heuristics for the Rectangle Packing Problem
نویسندگان
چکیده
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are of practical interest. AMS Classification: 90C 10, 90C 05, 90B06
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملLocal Search Heuristics for the Rectangle Packing Problem with General Spatial Costs
The two dimensional rectangle packing problem (2RP) is to place a given set of rectangles in the plane without overlap so that the given cost function is minimized. The edges of rectangles are required to be vertical or horizontal. There are various options on the packing rules and objective functions, e.g., rotations are allowed or not, a bin of fixed size to which rectangles should be packed ...
متن کاملA Novel Quasi-human Heuristic Algorithm for Two-dimensional Rectangle Packing Problem
Two-dimensional rectangle packing problem is the problem of packing a series of rectangles into a larger container with maximum area usage of the container. This problem involves many industrial applications, such as shipping, timber cutting, very large scale integration (VLSI) design, etc. It belongs to a subset of classical packing problems and has been shown to be NP hard. For solving this p...
متن کاملOffline Scheduling of Power Loads in Smart Grids
In this paper, we formulate and study a scheduling problem related to Smart Grids. Specifically, the goal is to schedule a set of power loads with same start time and deadlines using minimum peak power. A job can be scheduled anytime after the start time as long as it finished before the deadline. Certain jobs have the added flexibility of being scheduled intermittently i.e. with intermissions ...
متن کاملStrip Packing with Slicing
In the strip packing problem, a given set of axis-aligned rectangles must be packed into a fixed-width strip, and the goal is to minimize the height of the strip. In this paper, we examine a variant in which each rectangle may be cut vertically into multiple slices and the slices may be packed into the strip as individual pieces. Our results are: (1) analysis of the approximation ratio of sever...
متن کامل